Termination w.r.t. Q proof of TRS/various07.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, y) → h(x, y)
f(x, y) → h(y, x)
h(x, x) → x

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, y) → h(x, y)
f(x, y) → h(y, x)
h(x, x) → x

Q is empty.

We use [23] with the following order to prove termination.

Recursive path order with status [2].
Quasi-Precedence:

f₂ > h₂

Status:

trivial